Unclassified Report: Complexity of Min-Max Subsequence Problemspdfsubject
نویسندگان
چکیده
We determine the computational complexity of the problem of ordering a set of n numbers into a sequence as well as the problem of ordering them into a cycle, such that the maximum sum of k successive numbers is minimal. The former problem arises in effectively storing multimedia data on multi-zone hard disks. Conclusions: Both the problems are easy for k = 2 and strongly NP-hard for any k ≥ 3. However, in the latter case the two problems allow a polynomial-time approximation scheme that is linear in n. c ©Koninklijke Philips Electronics NV 2002 iii UR 2002/843 Unclassified iv c ©Koninklijke Philips Electronics NV 2002 Unclassified UR 2002/843
منابع مشابه
Complexity of min-max subsequence problems
We determine the computational complexity of the problem of ordering a set of n numbers, either into a sequence or a cycle, such that the maximum sum of any k successive numbers is minimal. Both problems are easy for k 2 and strongly NP-hard for any k 3. However, the two problems allow a polynomial-time approximation scheme that is linear in n. keywords: computational complexity, polynomial-tim...
متن کاملCombined super-/substring and super-/subsequence problems
Super-/substring problems and super-/subsequence problems are well known problems in stringology that have applications in a variety of areas, such as manufacturing systems design and molecular biology. Here we investigate the complexity of a new type of such problem that forms a combination of a super-/substring and a super-/subsequence problem. Moreover we introduce different types of minimal...
متن کاملOn Increasing Subsequences of I.i.d. Samples
We study the uctuations, in the large deviations regime, of the longest increasing subsequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of the longest increasing subsequence of a random permutation. i=1 denote a sequence of i.i.d. random variables with marginal law on the unit square Q = 0; 1] 2. ...
متن کاملOn Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet
In this paper we investigate the complexity of finding various kinds of common superand subsequences with respect to one or two given sets of strings. We show that Longest Minimal Common Supersequence, Shortest Maximal Common Subsequence, and Shortest Maximal Common Non-Supersequence are MAX SNP-hard over a binary alphabet. Moreover, we show that Shortest Common Supersequence, Longest Common Su...
متن کاملFast Parallel Algorithms for the Longest Common Subsequence Problem Using an Optical Bus
A parallel algorithm for the longest common subsequence problem on LARPBS is presented. For two sequences of lengths m and n, the algorithm uses p processors and costs O(mn/p) computation time where 1 ≤ p ≤ max{m, n}. Time-area cost of the algorithm is O(mn/p) and memory space required is O((m+n)/p) which all reach optimal. We also show this algorithm is scalable when the number of processors p...
متن کامل